On Optimizing the Editing Algorithms for Evaluating Similarity Between Monophonic Musical Sequences
نویسندگان
چکیده
Melody is an important property for the perceptual description of Western musical pieces. In the monophonic context, retrieval systems based on melodic similarity generally consider sequences of pitches and durations. Algorithms that have been proposed for measuring melodic similarity rely on geometric representations, string matching techniques, etc. Adaptations of editing algorithms, mainly applied in bioinformatic applications, to the musical domain have already been proposed. However, we present in this paper several experiments in order to optimize these methods. The different possible representations for pitches and durations are discussed and evaluated. Optimizations specific to musical applications are proposed and imply significant improvements of the editing algorithm studied. Evaluation of this algorithm led to the best results during the MIREX 2006 symbolic melodic similarity contest.
منابع مشابه
Optimizations of Local Edition for Evaluating Similarity Between Monophonic Musical Sequences
Melody is an important property for the perceptual description of Western musical pieces. In the monophonic context, retrieval systems based on melodic similarity generally consider sequences of pitches and durations. Algorithms that have been proposed for measuring melodic similarity rely on geometric representations, string matching techniques, etc. Adaptations of edit distance based algorith...
متن کاملA Robust Retrieval System of Polyphonic Music Based on Comparison of Chord Sequences
Retrieval systems for polyphonic music rely on the automatic estimation of the similarity between two musical pieces. In the case of symbolic music, existing systems consider a monophonic reduction based on melody or propose algorithms with high complexity. In this paper, a new approach is presented. Musical pieces are represented as a sequence of chords estimated from groups of notes sounding ...
متن کاملString Matching and Geometric Algorithm for Melodic Similarity
This abstract gives an overview on two algorithms, developed earlier in the C-BRAHMS group (Lemström et al. (2003)), that took part in the MIREX’05 melodic similarity contest. Given two excerpts of symbolically encoded music, the query pattern and the target music, the task of both these algorithms is to find musically relevant occurrences of the query pattern within the target music. The first...
متن کاملExtended abstract for submissions to MIREX 2006: Three algorithms for symbolic similarity computation
In the past we have explored different methods for abstracting information within different musical dimensions from melodies and for comparing, i.e. measuring the similarity, two abstract sequences which may represent monophonic melodies. All abstraction and similarity computation methods are implemented in our software toolbox SIMILE. The individual methods are described in greater detail in [7].
متن کاملMeasuring Musical Rhythm Similarity: Further Experiments with the Many-to-Many Minimum-Weight Matching Distance
Musical rhythms are represented as sequences of symbols. The sequences may be composed of binary symbols denoting either silent or monophonic sounded pulses, or ternary symbols denoting silent pulses and two types of sounded pulses made up of low-pitched (dum) and high-pitched (tak) sounds. Experiments are described that compare the effectiveness of the many-to-many minimum-weight matching betw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017